A Comparative Study of Pub/Sub Methods in Structured P2P Networks
Identifieur interne : 000875 ( Main/Exploration ); précédent : 000874; suivant : 000876A Comparative Study of Pub/Sub Methods in Structured P2P Networks
Auteurs : Matthias Bender [Allemagne] ; Sebastian Michel [Allemagne] ; Sebastian Parkitny [Allemagne] ; Gerhard Weikum [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
English descriptors
- Teeft :
- Actual document dissemination, Analytical model, Analytical results, Appropriate subscribers, Average number, Bender, Comparative study, Complexity complexity, Data networks, Design patterns, Directory, Directory node, Directory nodes, Directory peer, Directory peers, Document dissemination, Hash tables, High rates, Information retrieval, Large number, Larger variation, Lower publishing rate, Message types, Messaging complexity, Network dynamics, News story, Node, Optimal design pattern, Previous behavior, Promising publishers, Publisher, Publishers need, Publishing rate, Publishing rate increases, Research topic, Scenario, Small number, Subavg, Subscriber, Subscriber list, Subscribers snew, Subscription, Subscription process, Subscription terms, System model, System parameters, Time interval, Topics sports, Total number, Unstructured networks, Usage patterns.
Abstract
Abstract: Methods for publish/subscribe applications over P2P networks have been a research issue for a long time. Many approaches have been developed and evaluated, but typically each based on different assumptions, which makes their mutual comparison very difficult if not impossible. We identify two design patterns that can be used to implement publish/subscribe applications over structured P2P networks and provide an analytical analysis of their complexity. Based on a characterization of different real-world usage scenarios we present evidence as to which approach is preferable for certain application classes. Finally, we present simulation results that support our analysis.
Url:
DOI: 10.1007/978-3-540-71661-7_37
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001791
- to stream Istex, to step Curation: 001682
- to stream Istex, to step Checkpoint: 000689
- to stream Main, to step Merge: 000875
- to stream Main, to step Curation: 000875
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Comparative Study of Pub/Sub Methods in Structured P2P Networks</title><author><name sortKey="Bender, Matthias" sort="Bender, Matthias" uniqKey="Bender M" first="Matthias" last="Bender">Matthias Bender</name></author><author><name sortKey="Michel, Sebastian" sort="Michel, Sebastian" uniqKey="Michel S" first="Sebastian" last="Michel">Sebastian Michel</name></author><author><name sortKey="Parkitny, Sebastian" sort="Parkitny, Sebastian" uniqKey="Parkitny S" first="Sebastian" last="Parkitny">Sebastian Parkitny</name></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E609CEDCD6FC8CC10D370D41409086A1DFB76AF7</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-71661-7_37</idno><idno type="url">https://api.istex.fr/document/E609CEDCD6FC8CC10D370D41409086A1DFB76AF7/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001791</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001791</idno><idno type="wicri:Area/Istex/Curation">001682</idno><idno type="wicri:Area/Istex/Checkpoint">000689</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000689</idno><idno type="wicri:doubleKey">0302-9743:2007:Bender M:a:comparative:study</idno><idno type="wicri:Area/Main/Merge">000875</idno><idno type="wicri:Area/Main/Curation">000875</idno><idno type="wicri:Area/Main/Exploration">000875</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Comparative Study of Pub/Sub Methods in Structured P2P Networks</title><author><name sortKey="Bender, Matthias" sort="Bender, Matthias" uniqKey="Bender M" first="Matthias" last="Bender">Matthias Bender</name><affiliation wicri:level="1"><country>Allemagne</country><placeName><settlement type="city">Sarrebruck</settlement><region type="land" nuts="1">Sarre (Land)</region></placeName><wicri:regionArea>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85</wicri:regionArea><wicri:noRegion>Stuhlsatzenhausweg 85</wicri:noRegion><wicri:noRegion>Stuhlsatzenhausweg 85</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Michel, Sebastian" sort="Michel, Sebastian" uniqKey="Michel S" first="Sebastian" last="Michel">Sebastian Michel</name><affiliation wicri:level="1"><country>Allemagne</country><placeName><settlement type="city">Sarrebruck</settlement><region type="land" nuts="1">Sarre (Land)</region></placeName><wicri:regionArea>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85</wicri:regionArea><wicri:noRegion>Stuhlsatzenhausweg 85</wicri:noRegion><wicri:noRegion>Stuhlsatzenhausweg 85</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Parkitny, Sebastian" sort="Parkitny, Sebastian" uniqKey="Parkitny S" first="Sebastian" last="Parkitny">Sebastian Parkitny</name><affiliation wicri:level="1"><country>Allemagne</country><placeName><settlement type="city">Sarrebruck</settlement><region type="land" nuts="1">Sarre (Land)</region></placeName><wicri:regionArea>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85</wicri:regionArea><wicri:noRegion>Stuhlsatzenhausweg 85</wicri:noRegion><wicri:noRegion>Stuhlsatzenhausweg 85</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation wicri:level="1"><country>Allemagne</country><placeName><settlement type="city">Sarrebruck</settlement><region type="land" nuts="1">Sarre (Land)</region></placeName><wicri:regionArea>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85</wicri:regionArea><wicri:noRegion>Stuhlsatzenhausweg 85</wicri:noRegion><wicri:noRegion>Stuhlsatzenhausweg 85</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2007</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Actual document dissemination</term><term>Analytical model</term><term>Analytical results</term><term>Appropriate subscribers</term><term>Average number</term><term>Bender</term><term>Comparative study</term><term>Complexity complexity</term><term>Data networks</term><term>Design patterns</term><term>Directory</term><term>Directory node</term><term>Directory nodes</term><term>Directory peer</term><term>Directory peers</term><term>Document dissemination</term><term>Hash tables</term><term>High rates</term><term>Information retrieval</term><term>Large number</term><term>Larger variation</term><term>Lower publishing rate</term><term>Message types</term><term>Messaging complexity</term><term>Network dynamics</term><term>News story</term><term>Node</term><term>Optimal design pattern</term><term>Previous behavior</term><term>Promising publishers</term><term>Publisher</term><term>Publishers need</term><term>Publishing rate</term><term>Publishing rate increases</term><term>Research topic</term><term>Scenario</term><term>Small number</term><term>Subavg</term><term>Subscriber</term><term>Subscriber list</term><term>Subscribers snew</term><term>Subscription</term><term>Subscription process</term><term>Subscription terms</term><term>System model</term><term>System parameters</term><term>Time interval</term><term>Topics sports</term><term>Total number</term><term>Unstructured networks</term><term>Usage patterns</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Methods for publish/subscribe applications over P2P networks have been a research issue for a long time. Many approaches have been developed and evaluated, but typically each based on different assumptions, which makes their mutual comparison very difficult if not impossible. We identify two design patterns that can be used to implement publish/subscribe applications over structured P2P networks and provide an analytical analysis of their complexity. Based on a characterization of different real-world usage scenarios we present evidence as to which approach is preferable for certain application classes. Finally, we present simulation results that support our analysis.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Bender, Matthias" sort="Bender, Matthias" uniqKey="Bender M" first="Matthias" last="Bender">Matthias Bender</name></region><name sortKey="Bender, Matthias" sort="Bender, Matthias" uniqKey="Bender M" first="Matthias" last="Bender">Matthias Bender</name><name sortKey="Michel, Sebastian" sort="Michel, Sebastian" uniqKey="Michel S" first="Sebastian" last="Michel">Sebastian Michel</name><name sortKey="Michel, Sebastian" sort="Michel, Sebastian" uniqKey="Michel S" first="Sebastian" last="Michel">Sebastian Michel</name><name sortKey="Parkitny, Sebastian" sort="Parkitny, Sebastian" uniqKey="Parkitny S" first="Sebastian" last="Parkitny">Sebastian Parkitny</name><name sortKey="Parkitny, Sebastian" sort="Parkitny, Sebastian" uniqKey="Parkitny S" first="Sebastian" last="Parkitny">Sebastian Parkitny</name><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000875 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000875 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:E609CEDCD6FC8CC10D370D41409086A1DFB76AF7
|texte= A Comparative Study of Pub/Sub Methods in Structured P2P Networks
}}
| This area was generated with Dilib version V0.6.33. |  |